The Rabin Cryptosystem & analysis in measure of Chinese Reminder Theorem
نویسندگان
چکیده
Cryptography is the practise and study of techniques for secure communication in the presence of third parties. The necessity and the fact that exchanged messages are exposed to other people during the transmission promoted the creation of encryption systems, enabling just the recipients to interpret the exchanged information. In this paper, a particular cryptosystem called Rabin Cryptosystem is presented and analysed with the help of Chinese Reminder Theorem. Also, redundancy schemes for decryptions technique is mentioned and some basic mathematical concepts is explained and finally compared with RSA cryptosystem in terms of security and efficiency.
منابع مشابه
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely used algorithm. We prove the correctness of the Rabin-Miller algorithm in the theory V for polynomial time reasoning, from Fermat’s little theorem. This is interesting because the Rabin-Miller algorithm is a polytime ra...
متن کاملEfficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, ...
متن کاملEfficient Reverse Converter for Three Modules Set {2^n-1,2^(n+1)-1,2^n} in Multi-Part RNS
Residue Number System is a numerical system which arithmetic operations are performed parallelly. One of the main factors that affects the system’s performance is the complexity of reverse converter. It should be noted that the complexity of this part should not affect the earned speed of parallelly performed arithmetic unit. Therefore in this paper a high speed converter for moduli set {2n-1, ...
متن کاملUcl Crypto Group Technical Report Series Reducing the Elliptic Curve Cryptosystem of Meyer-m Uller to the Cryptosystem of Rabin-williams Reducing the Elliptic Curve Cryptosystem of Meyer-m Uller to the Cryptosystem of Rabin-williams
At Eurocrypt'96, Meyer and M uller presented a new Rabin-type cryptosystem based on elliptic curves. In this paper, we will show that this cryptosystem may be reduced to the cryptosystem of Williams-Rabin.
متن کاملAnalysis of Rabin and Rabin-P Cryptosystem for specifying correct plain text
This work, introduced a new, competent and useful scheme based on the Rabin cryptosystem without using the Jacobi symbol [1], message redundancy technique or the needs of extra bits in order to specify the correct plaintext. This system involves only a single prime number. This also analysed and discussed the comparison between the old system and the new system with suitable examples and result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013